Signless Laplacian determinations of some graphs with independent edges
نویسندگان
چکیده
منابع مشابه
SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملSeidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملEla on the Least Signless Laplacian Eigenvalue of Some Graphs
For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.
متن کاملOn the least signless Laplacian eigenvalues of some graphs
For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.
متن کاملSome Graphs Determined by Their (signless) Laplacian Spectra
Let Wn = K1 ∨ Cn−1 be the wheel graph on n vertices, and let S(n, c, k) be the graph on n vertices obtained by attaching n− 2c− 2k − 1 pendant edges together with k hanging paths of length two at vertex v0, where v0 is the unique common vertex of c triangles. In this paper we show that S(n, c, k) (c > 1, k > 1) and Wn are determined by their signless Laplacian spectra, respectively. Moreover, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Carpathian Mathematical Publications
سال: 2018
ISSN: 2313-0210,2075-9827
DOI: 10.15330/cmp.10.1.185-196